MIME-Version: 1.0
Server: CERN/3.0
Date: Tuesday, 14-Jan-97 20:06:31 GMT
Content-Type: text/html
Content-Length: 3434
Last-Modified: Friday, 22-Nov-96 22:37:06 GMT

<html>
<title>
G22.1170: Fundamental Algorithms
</title>
<body bgcolor="EEEEEE">

<h4><font color=AA0000> <center>
Fundamental Algorithms, G22.1170 <br>
Fall 1996
</center></font> </h4>

<!WA0><img src="http://jinai.nyu.edu:9999/gifs/lines/rainbowline.gif">
<h3><font color=AA00AA> <center>
SYLLABUS
</center></font> </h3>

<table border=2>
<tr align=left>
	<th>Instructor:</th>
	<td>Chee Yap  </td>
</tr><tr align=left>
	<th>E-mail address:</th>
	<td>yap@cs.nyu.edu </td>
</tr><tr align=left>
	<th>Phone number:</th>
	<td> (212) 998-3115. </td>
</tr><tr align=left>
	<th>Office:</th>
	<td> Room~416, Weaver Hall.</td>  
</tr><tr align=left>
	<th>Office hours:</th>
	<td> Mon 6-7 </td>
</tr><tr align=left>
	<th>Lectures:</th>
	<td> Wednesdays 5:00--6:50 in Room 109, Warren Weaver Hall.</td>
</tr><tr align=left>
	<th>Problem Sessions:</th>
	<td> Mondays 5:00--6:00 in Room 109, Warren Weaver Hall.</td>
</tr><tr align=left>
	<th>Teaching Assistant:</th>
	<td> Juan Carlos Porras (porras@cs.nyu.edu)</td>
</tr><tr align=left>
	<th>TA's Office hours:</th>
	<td>Tue 6-7 and Wed 4-5</td>
</tr><tr align=left>
	<th>Textbook:</th>
	<td> Cormen, Leiserson, and Rivest (1990),
	<br><i>Introduction to Algorithms, McGraw-Hill.
	</i>
	<br><font color="AA0000">
	 NOTE: an errata list for this book can be obtained from
	ftp://theory.lcs.mit.edu/pub/algorithms.</font>
	</td>
</tr><tr align=left>
	<th>Prerequisites:</th>
	<td> Familiarity with data structures such as
	linked lists and binary trees,<br>
	and topics in discrete
	mathematics such as induction and graphs.</td>
</tr>
</table>
</body>
</html>

<!--
\section*{Work} 

\hspace*{\parindent}
Weekly problem sets and a final examination.  There will be
approximately 10 problem sets, worth about 50\% of your grade.
The midterm and final exam is worth about 15\% and 35\%, respectively.

\section*{Problem Session} 

\hspace*{\parindent} The problem session will review the solutions to
the previous week's problem set.  In addition, I will go over the
solutions to a collection of exercises that I will have handed out.
Finally, I will try to answer any questions that you have.

\section*{Help} 

\hspace*{\parindent}
If you feel overloaded or need help, please contact me.
Don't let yourself fall behind.

\section*{Outline}

\begin{enumerate}
 \item Mathematical Foundations
  \begin{enumerate}
   \item Overview of Algorithms (Chapter 1) 
   \item Sets and Functions (Chapter 5)
   \item Asymptotics (Chapter 2)
   \item Sums (Chapter 3)
   \item Recurrences (Chapter 4)
  \end{enumerate}
 \item Data Structures
  \begin{enumerate}
   \item Stacks and Queues (Chapter 11)
   \item Dictionaries: Search Trees (Chapter 13)
   \item Dictionaries: Balanced Search Trees (Chapter 14)
   \item Dictionaries: Hashing (Chapter 12)
   \item Priority Queues (Chapter 7)
  \end{enumerate}
 \item Sorting and Selection
  \begin{enumerate}
   \item Quick Sort (Chapter 8)
   \item Radix Sort (Chapter 9)
   \item Selection (Chapter 10)
  \end{enumerate}
 \item Graph Algorithms
  \begin{enumerate}
   \item Graph Searching (Chapter 23)
   \item Spanning Trees (Chapter 24)
   \item Shortest Paths: Single Source (Chapter 25)
   \item Shortest Paths: All Pairs (Chapter 26)
  \end{enumerate}
 \item Advanced Topics
  \begin{enumerate}
   \item Dynamic Programming (Chapter 16)
   \item NP-complete Problems (Chapter 36)
   \item Approximation Algorithms (Chapter 37)
  \end{enumerate}
\end{enumerate}

\end{document}

-->

